package binarySearch;

public class searchInsert {
    public int searchInsert(int[] nums, int target) {
        int left=0;
        int right=nums.length-1;
        int mid=0;
        while(left<=right){
            mid=left+(right-left+1)/2;
            if(nums[mid]>target)right=mid-1;
            else if(nums[mid]<target)left=mid+1;
            else return mid;
        }
        if(nums[mid]>target&&mid!=0)  return mid;
        else if(nums[mid]>target&&mid==0) return 0;
        return mid+1;
    }
}
